Spanning trees in 3-connected K3, t-minor-free graphs
نویسندگان
چکیده
In this paper, we show that for any even integer t ≥ 4, every 3-connected graph with no K3,t-minor has a spanning tree whose maximum degree is at most t − 1. This result is a common generalization of the result by Barnette [1] and the one by Chen, Egawa, Kawarabayashi, Mohar and Ota [4].
منابع مشابه
Toughness of Ka,t-Minor-Free Graphs
The toughness of a non-complete graph G is the minimum value of |S| ω(G−S) among all separating vertex sets S ⊂ V (G), where ω(G − S) > 2 is the number of components of G−S. It is well-known that every 3-connected planar graph has toughness greater than 1/2. Related to this property, every 3-connected planar graph has many good substructures, such as a spanning tree with maximum degree three, a...
متن کاملToughness and spanning trees in K4mf graphs
A k-tree is a tree with maximum degree at most k, and a k-walk is a closed walk with each vertex repeated at most k times. A k-walk can be obtained from a k-tree by visiting each edge of the k-tree twice. Jackson and Wormald conjectured in 1990 that for k ≥ 2, every 1 k−1 -tough connected graph contains a spanning k-walk. This conjecture is open even for planar graphs. We confirm this conjectur...
متن کاملThe circumference of a graph with no K3, t-minor
The class of graphs with no K3,t-minors, t ≥ 3, contains all planar graphs and plays an important role in graph minor theory. In 1992, Seymour and Thomas conjectured the existence of a function α(t) > 0 and a constant β > 0, such that every 3-connected n-vertex graph with no K3,t-minors, t ≥ 3, contains a cycle of length at least α(t)n . The purpose of this paper is to confirm this conjecture w...
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملA simple existence criterion for normal spanning trees in infinite graphs
A spanning tree of an infinite graph is normal if the endvertices of any chord are comparable in the tree order defined by some arbitrarily chosen root. (In finite graphs, these are their ‘depth-first search’ trees; see [3] for precise definitions.) Normal spanning trees are perhaps the most important single structural tool for analysing an infinite graph (see [4] for a good example), but they ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 102 شماره
صفحات -
تاریخ انتشار 2009